#include<bits/stdc++.h>
using namespace std;
long long n,a[100005],ans;
bool vis[100005];
int main(){
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
	cin>>n;
	ans=n;
	for (int i=1;i<=n;i++)
		scanf("%lld",&a[i]);
	sort(a+1,a+n+1);
	reverse(a+1,a+n+1);
	for (int i=1;i<=n;i++){
	    if (vis[i]==0){
			if (a[i]>a[i+1]){
				vis[i+1]=1;
				ans--;
			}
		}
	}
	printf("%lld",ans);
	return 0;
}
